An efficient and fault-tolerant solution for distributed mutual exclusion
نویسندگان
چکیده
منابع مشابه
A Fault-tolerant Mutual Exclusion Algorithm in Asynchronous Distributed Systems
Mutual Exclusion is one of the most studied topics in distributed systems where processes communicate by asynchronous message passing. It is often necessary for multiple processes at different sites to access a shared resource or data called a critical section (CS) in distributed systems. A number of algorithms have been proposed to solve the mutual exclusion problem in distributed systems. In ...
متن کاملA Framework for Fault-Tolerant Distributed Mutual Exclusion and Replica Control Using Grid Structures
This paper presents a framework for fault-tolerant distributed mutual exclusion and replica control algorithms utilizing overlapping grid quorums, which are sets constructed with the aid of grid structures. There are two components of the framework: the first one concerns generic representation of grid quorums, and the second one, generic verification of the overlapping properties of grid quoru...
متن کاملFault-tolerant Quality-of-service-enabled Distributed Mutual Exclusion for Message-Oriented Middleware
Distributed mutual exclusion is the process of ensuring exclusive access to a shared resource between multiple competing threads of execution in a distributed system. Despite the utility of distributed mutual exclusion, conventional messageoriented middleware generally does not support this feature, so application developers who need it must create their own ad hoc solutions, which are often in...
متن کاملA Fault-Tolerant h-Out of-k Mutual Exclusion Algorithm Using Cohorts Coteries for Distributed Systems
In this paper, we propose a distributed algorithm for solving the h-out of-k mutual exclusion problem with the aid of a specific k-coterie cohorts coterie. The proposed algorithm is resilient to node and/or link failures, and has constant message cost in the best case. Furthermore, it is a candidate to achieve the highest availability among all the algorithms using k-coteries. We analyze the ...
متن کاملA Fault Tolerant Token-based Algorithm for Group Mutual Exclusion in Distributed Systems
The group mutual exclusion (GME) problem is a variant of the mutual exclusion problem. In the present paper a token-based group mutual exclusion algorithm, capable of handling transient faults, is proposed. The algorithm uses the concept of dynamic request sets. A time out mechanism is used to detect the token loss; also, a distributed scheme is used to regenerate the token. The worst case mess...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computer Systems
سال: 1991
ISSN: 0734-2071,1557-7333
DOI: 10.1145/103727.103728